Research on Dynamic Clustering Algorithm Based on Spark Framework
نویسندگان
چکیده
منابع مشابه
CLUS: Parallel Subspace Clustering Algorithm on Spark
Subspace clustering techniques were proposed to discover hidden clusters that only exist in certain subsets of the full feature spaces. However, the time complexity of such algorithms is at most exponential with respect to the dimensionality of the dataset. In addition, datasets are generally too large to fit in a single machine under the current big data scenarios. The extremely high computati...
متن کاملResearch on the Parallelization of the DBSCAN Clustering Algorithm for Spatial Data Mining Based on the Spark Platform
Density-based spatial clustering of applications with noise (DBSCAN) is a density-based clustering algorithm that has the characteristics of being able to discover clusters of any shape, effectively distinguishing noise points and naturally supporting spatial databases. DBSCAN has been widely used in the field of spatial data mining. This paper studies the parallelization design and realization...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملResearch on Information Retrieval System Based on Ant Clustering Algorithm
Internet is more and more widely used, which provide a valuable information resource for users. How retrieve the information users prefers rapidly and accurately become the focus nowadays. With introducing ant-based clustering and sorting, it makes a more precise and rapid clustering result. Consequently, it increases the speed and efficiency of information retrieval.
متن کاملResearch on Image Segmentation based on Clustering Algorithm
Hierarchical clustering (HC) algorithm can obtain good clustering results, but it needs large storage and computational complexity for large image processing. Anew color image segmentation algorithm based on mean shift and hierarchical clustering algorithm named MSHC is presented in this paper. MSHC algorithm preprocesses an input image by MS algorithm to form segmented regions that preserve th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Application
سال: 2016
ISSN: 2161-8801,2161-881X
DOI: 10.12677/csa.2016.611086